Improved Source Coding Exponents via Witsenhausen's Rate
نویسندگان
چکیده
منابع مشابه
Error exponents in scalable source coding
The characterization of the set of achievable rate and distortion values for scalable source coding is extended to additionally account for error exponents, namely, the negative normalized asymptotic log likelihood of error events at different layers. The “error” at each layer is defined as the event that the source block is not reproduced within the prespecified fidelity at the corresponding d...
متن کاملSource coding exponents for zero-delay coding with finite memory
Fundamental limits on the source coding exponents (or large deviations performance) of zero-delay finite-memory (ZDFM) lossy source codes are studied. Our main results are the following. For any memoryless source, a suitably designed encoder that time-shares (at most two) memoryless scalar quantizers is as good as any time-varying fixed-rate ZDFM code, in that it can achieve the fastest exponen...
متن کاملRandom coding exponents galore via decoupling
A missing piece in quantum information theory, with very few exceptions, has been to provide the random coding exponents for quantum information-processing protocols. We remedy the situation by providing these exponents for a variety of protocols including those at the top of the family tree of protocols. Our line of attack is to provide an exponential bound on the decoupling error for a restri...
متن کاملExponents of quantum fixed-length pure state source coding
We derive the optimal exponent of the error probability of the quantum fixedlength pure state source coding in both cases of blind coding and visible coding. The optimal exponent is universally attained by Josza et al. (PRL, 81, 1714 (1998))’s universal code. In the converse part, Nielsen and Kempe (PRL, 86, 5184 (2001))’s lemma is essential. In the direct part, a group representation theoretic...
متن کاملError Exponents for Joint Source-Channel Coding with Delay-Constraints
Traditionally, joint source-channel coding is viewed in the block coding context — all the source symbols are known in advance by the encoder. Here, we consider source symbols to be revealed to the encoder in real time and require that they be reconstructed at the decoder within a certain fixed end-to-end delay. We derive upper and lower bounds on the reliability function with delay for cases w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2011
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2011.2162178